Dominating set is fixed parameter tractable in claw-free graphs

We show that the DOMINATING SET problem parameterized by solution size is fixed-parameter tractable (FPT) in graphs that do not contain the claw (K1,3, the complete bipartite graph on four vertices where the two parts have one and three vertices, respectively) as an induced subgraph. We present an algorithm that uses 2 2)nO(1) time and polynomial space to decide whether a claw-free graph on n vertices has a dominating set of size at most k. Note that this parameterization of DOMINATING SET is W [2]-hard on the set of all graphs, and thus is unlikely to have an FPT algorithm for graphs in general. The most general class of graphs for which an FPT algorithm was previously known for this parameterization of DOMINATING SET is the class of Ki,j-free graphs, which exclude, for some fixed i, j ∈ N, the complete bipartite graph Ki,j as a subgraph. For i, j ≥ 2, the class of claw-free graphs and any class of Ki,j-free graphs are not comparable with respect to set inclusion. We thus extend the range of graphs over which this parameterization of DOMINATING SET is known to be fixed-parameter tractable. We also show that, in some sense, it is the presence of the claw that makes this parameterization of the DOMINATING SET problem hard. More precisely, we show that for any t ≥ 4, the DOMINATING SET problem parameterized by the solution size is W [2]-hard in graphs that exclude the t-claw K1,t as an induced subgraph. Our arguments also imply that the related CONNECTED DOMINATING SET and DOMINATING CLIQUE problems are W [2]-hard in these graph classes. Finally, we show that for any t ∈ N, the CLIQUE problem parameterized by solution size, which is W [1]-hard on general graphs, is FPT in t-claw-free graphs. Our results add to the small and growing collection of FPT results for graph classes defined by excluded subgraphs, rather than by excluded minors.